SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
نویسندگان
چکیده
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not only render it easy to implement, but also convenient to execute on external storage. Furthermore, it can easily be extended to allow for “fuzzy” frequent item set mining in the sense that missing items can be inserted into transactions with a user-specified penalty. In order to demonstrate its performance, we report experiments comparing it with the “fuzzy” frequent item set mining version of RElim (an algorithm we suggested in an earlier paper [15] and improved in the meantime). Keywords— data mining, frequent item set mining, fuzzy frequent item set, fault tolerant data mining
منابع مشابه
(Approximate) Frequent Item Set Mining Made Simple with a Split and Merge Algorithm
In this paper we introduce SaM, a split and merge algorithm for frequent item set mining. Its core advantages are its extremely simple data structure and processing scheme, which not only make it very easy to implement, but also fairly easy to execute on external storage, thus rendering it a highly useful method if the data to mine cannot be loaded into main memory. Furthermore, we present exte...
متن کاملImproved Frequent Pattern Mining Algorithm using Divide and Conquer Technique with Current Problem Solutions
Frequent patterns are patterns such as item sets, subsequences or substructures that appear in a data set frequently. A Divide and Conquer method is used for finding frequent item set mining. Its core advantages are extremely simple data structure and processing scheme. Divide the original dataset in the projected database and find out the frequent pattern from the dataset. Split and Merge uses...
متن کاملSimple Algorithms for Frequent Item Set Mining
In this paper I introduce SaM, a split and merge algorithm for frequent item set mining. Its core advantages are its extremely simple data structure and processing scheme, which not only make it quite easy to implement, but also very convenient to execute on external storage, thus rendering it a highly useful method if the transaction database to mine cannot be loaded into main memory. Furtherm...
متن کاملAn Efficient Algorithm for Mining Fuzzy Temporal Data
Mining patterns from fuzzy temporal data is an important data mining problem. One of these mining task is to find locally frequent sets, In most of the earlier works fuzziness was considered in the time attribute of the datasets .Although a couple of works have been done in dealing with such data, little has been done on the implementation side. In this article, we propose an efficient implemen...
متن کاملMINING FUZZY TEMPORAL ITEMSETS WITHIN VARIOUS TIME INTERVALS IN QUANTITATIVE DATASETS
This research aims at proposing a new method for discovering frequent temporal itemsets in continuous subsets of a dataset with quantitative transactions. It is important to note that although these temporal itemsets may have relatively high textit{support} or occurrence within particular time intervals, they do not necessarily get similar textit{support} across the whole dataset, which makes i...
متن کامل